import java.util.*;
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
//链表1和链表2不相同时每个的走完自己的和对方的路程，如果相遇则一定游相等的节点
public class Solution {
    public ListNode FindFirstCommonNode(ListNode pHead1, ListNode pHead2) {
 ListNode l1=pHead1;
 ListNode l2=pHead2;
 while(l1!=l2){
    l1=(l1==null)?pHead2:l1.next;
    l2=(l2==null)?pHead1:l2.next;
 }
 return l1;
    }
}
